A semi-Lagrangian scheme for L-penalized minimum time problems
نویسندگان
چکیده
In this paper we consider a semi-Lagrangian scheme for minimum time problems with L-penalization. The minimum time function of the penalized control problem can be characterized as the solution of a Hamilton-Jacobi Bellman (HJB) equation. Furthermore, the minimum time converges with respect to the penalization parameter to the minimum time of the non-penalized problem. To solve the control problem we formulate the discrete dynamic programming principle and set up a semi-Lagrangian scheme. Various numerical examples are presented studying the effects of different choices of the penalization parameters.
منابع مشابه
Solving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes
In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...
متن کاملA semi-Lagrangian finite difference WENO scheme for scalar nonlinear conservation laws
For a nonlinear scalar conservation law in one-space dimension, we develop a locally conservative semi-Lagrangian finite difference scheme based on weighted essentially non-oscillatory reconstructions (SL-WENO). This scheme has the advantages of both WENO and semi-Lagrangian schemes. It is a locally mass conservative finite difference scheme, it is formally high-order accurate in space, it has ...
متن کاملA High-Order Semi-Lagrangian/Finite Volume Scheme for Hamilton-Jacobi-Isaacs Equations
We present a numerical scheme for the approximation of Hamilton-JacobiIsaacs equations related to optimal control problems and differential games. In the first case, the Hamiltonian is convex with respect to the gradient of the solution, whereas the second case corresponds to a non convex (minmax) operator. We introduce a scheme based on the combination of semi-Lagrangian time discretization wi...
متن کاملAn Adaptive Sparse Grid Semi-Lagrangian Scheme for First Order Hamilton-Jacobi Bellman Equations
We propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to deal with non-linear time-dependent Hamilton-Jacobi Bellman equations. We focus in particular on front propagation models in higher dimensions which are related to control problems. We test the numerical efficiency of the method on several benchmark problems up to space dimension d = 8, and give evidence of convergenc...
متن کاملWeakly Chained Matrices, Policy Iteration, and Impulse Control
This work is motivated by numerical solutions to Hamilton-Jacobi-Bellman quasivariational inequalities (HJBQVIs) associated with combined stochastic and impulse control problems. In particular, we consider (i) direct control, (ii) penalized, and (iii) semi-Lagrangian discretization schemes applied to the HJBQVI problem. Scheme (i) takes the form of a Bellman problem involving an operator which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015